Speaker : David Aldous

Topics: Mathematics, lecture

Speaker: John Cardy Date: 05/01/01

Topics: Mathematics, lectures

Speaker: Elon Lindenstrauss Date: May 2003

Topics: Mathematics, lectures

Speaker: Emma Carberry Date: Aug, 2003

Topics: Mathematics, lectures

Speaker: Mu-Tao Wang Date: December 2003

Topics: Mathematics, lectures

Speaker: Joel Hass Date: August 2003

Topics: Mathematics, Lectures

Speaker: Joel Hass Date: August 2003

Topics: Mathematics, Lectures

Speaker: Francisco Santos Date: November, 2003

Topics: Mathematics, lectures

Speaker : Dave Marker

Topics: Mathematics, lecture

Speaker : Zoe Chatzidakis

Topics: Mathematics, lecture

Speaker : Lou Van Den Dries

Topics: Mathematics, lecture

Speaker : Lou Van Den Dries

Topics: Mathematics, lecture

Speaker : Lou Van Den Dries

Topics: Mathematics, lecture

Speaker : Chris Skinner

Topics: Mathematics, lecture

Speaker : Chris Skinner

Topics: Mathematics, lecture

Speaker : Chris Skinner

Topics: Mathematics, lecture

Abstract: The natural functor from the complex smooth representations of a reductive $p$-adic group $G$ to the right modules of the complex affine Iwahori-Hecke algebra $H$, sending a representation of $G$ to its invariants by an Iwahori group $I$, is well known to be important. By a theorem of Borel and Bernstein, the $I$-invariant functor gives an equivalence of categories from the unipotent block $cal B$ of $G$ to the category $cal M$ of modules of $H$. In this talk, we will discuss this...

Topics: Mathematics, Lectures

Speaker : Jordan Ellenberg

Topics: Mathematics, lecture

Speaker: Bernard Teissier Series: Introductory Workshop in Commutative Algebra Date: September 11, 2002, 10:30 am

Topics: Mathematics, lectures

Speaker: Adrian Dumitrescu Date: October, 2003

Topics: Mathematics, lectures

Speaker: Lei Ni Date: Dec, 2003

Topics: Mathematics, lectures

Speaker: Karoly Bezdek Date: November, 2003

Topics: Mathematics, lectures

Speaker : Alois Panholzer Keywords: Analysis of algorithms; Grobner bases; generic complexity; coalescence of saddle-points. Abstract: While the computation of Grobner bases is known to be an exsapace complete problem, the generic behavior of the algorithms for their bases and analyze precisely the best algorithm currently known.

Topics: Mathematics, lecture

Speaker: Francisco Santos Date: July 2003

Topics: Mathematics, Lectures

Speaker: Francisco Santos Date: July 2003

Topics: Mathematics, Lectures

Date: October 25th, 2002

Topics: Mathematics, Lectures